A Tight Upper Bound on Acquaintance Time of Graphs
نویسندگان
چکیده
In this note we confirm a conjecture raised by Benjamini et al. [BST13] on the acquaintance time of graphs, proving that for all graphs G with n vertices it holds that AC(G) = O(n3/2), which is tight up to a multiplicative constant. This is done by proving that for all graphs G with n vertices and maximal degree ∆ it holds that AC(G) ≤ 20∆n. Combining this with the bound AC(G) ≤ O(n2/∆) from [BST13] gives the foregoing uniform upper bound of all n-vertex graphs. We also prove that for the n-vertex path Pn it holds that AC(Pn) = n − 2. In addition we show that the barbell graph Bn consisting of two cliques of sizes dn/2e and bn/2c connected by a single edge also has AC(Bn) = n−2. This shows that it is possible to add Ω(n2) edges to Pn without changing the AC value of the graph.
منابع مشابه
Sharp Upper bounds for Multiplicative Version of Degree Distance and Multiplicative Version of Gutman Index of Some Products of Graphs
In $1994,$ degree distance of a graph was introduced by Dobrynin, Kochetova and Gutman. And Gutman proposed the Gutman index of a graph in $1994.$ In this paper, we introduce the concepts of multiplicative version of degree distance and the multiplicative version of Gutman index of a graph. We find the sharp upper bound for the multiplicative version of degree distance and multiplicative ver...
متن کاملNew results on upper domatic number of graphs
For a graph $G = (V, E)$, a partition $pi = {V_1,$ $V_2,$ $ldots,$ $V_k}$ of the vertex set $V$ is an textit{upper domatic partition} if $V_i$ dominates $V_j$ or $V_j$ dominates $V_i$ or both for every $V_i, V_j in pi$, whenever $i neq j$. The textit{upper domatic number} $D(G)$ is the maximum order of an upper domatic partition. We study the properties of upper domatic number and propose an up...
متن کاملOn trees attaining an upper bound on the total domination number
A total dominating set of a graph $G$ is a set $D$ of vertices of $G$ such that every vertex of $G$ has a neighbor in $D$. The total domination number of a graph $G$, denoted by $gamma_t(G)$, is~the minimum cardinality of a total dominating set of $G$. Chellali and Haynes [Total and paired-domination numbers of a tree, AKCE International ournal of Graphs and Combinatorics 1 (2004), 6...
متن کاملThe second geometric-arithmetic index for trees and unicyclic graphs
Let $G$ be a finite and simple graph with edge set $E(G)$. The second geometric-arithmetic index is defined as $GA_2(G)=sum_{uvin E(G)}frac{2sqrt{n_un_v}}{n_u+n_v}$, where $n_u$ denotes the number of vertices in $G$ lying closer to $u$ than to $v$. In this paper we find a sharp upper bound for $GA_2(T)$, where $T$ is tree, in terms of the order and maximum degree o...
متن کاملBounds for algebraic gossip on graphs
We study the stopping times of gossip algorithms fornetwork coding. We analyze algebraic gossip (i.e., random linearcoding) and consider three gossip algorithms for informationspreading: Pull, Push, and Exchange. The stopping time ofalgebraic gossip is known to be linear for the complete graph, butthe question of determining a tight upper bound or lower boundsfor general...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Graphs and Combinatorics
دوره 32 شماره
صفحات -
تاریخ انتشار 2016